0958.Check Completeness of a Binary Tree_test.go

package leetcode

import (
"fmt"
"testing"

"github.com/halfrost/LeetCode-Go/structures"
)

typequestion958struct {
para958
ans958
}

// para 是参数
// one 代表第一个参数
typepara958struct {
one []int
}

// ans 是答案
// one 代表第一个答案
typeans958struct {
onebool
}

funcTest_Problem958(t*testing.T) {

qs:= []question958{

 {
para958{[]int{1, 2, 3, 4, 5, 6}},
ans958{true},
 },

 {
para958{[]int{1, 2, 3, 4, 5, structures.NULL, 7}},
ans958{false},
 },
 }

fmt.Printf("------------------------Leetcode Problem 958------------------------\n")

for_, q:=rangeqs {
_, p:=q.ans958, q.para958
fmt.Printf("【input】:%v ", p)
root:=structures.Ints2TreeNode(p.one)
fmt.Printf("【output】:%v \n", isCompleteTree(root))
 }
fmt.Printf("\n\n\n")
}